On Capacity of Line Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Enhancement of Ad Hoc Networks using a New Beamforming Scheme Based on ESPAR

This paper proposes a new smart antenna beamforming scheme based on electronically steerable parasitic array radiator (ESPAR). The proposed method is capable of providing better capacity compared to the conventional ESPAR. The termination of each antenna element in this structure comprises a PIN diode in addition to a varactor. Using PIN diode besides the varactor provides more degrees of freed...

متن کامل

On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks

In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and generation rates. Specifically, in this paper we first present two centralized on-line algorithms for...

متن کامل

Comment on "Regularizing capacity of metabolic networks".

In a recent paper, Marr, Müller-Linow, and Hütt [Phys. Rev. E 75, 041917 (2007)] investigate an artificial dynamic system on metabolic networks. They find a less complex time evolution of this dynamic system in real networks, compared to networks of null models. The authors argue that this suggests that metabolic network structure is a major factor behind the stability of biochemical steady sta...

متن کامل

On the Capacity of Wireless Multicast Networks

A wireless multicast network with a stringent decoding delay constraint and a minimum required multicast data rate is characterized. Assuming the channel state information is available only at the receiver side, and a single antenna system, the optimal expected rate achievable by a random user in the network is derived in terms of the minimum multicast requirement in two scenarios: hard coverag...

متن کامل

On the Capacity of ‘Cheap’ Relay Networks

We consider the communication problem in a multi-hop relay network where the intermediate relay nodes cannot transmit and receive at the same time. The motivation for this assumption comes from the fact that current radios operate in TDD mode when the transmitting and receiving frequencies are the same. We label such a node radio as a cheap radio and the corresponding node of the network as a c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2007

ISSN: 0018-9448

DOI: 10.1109/tit.2007.907513